Close

1. Identity statement
Reference TypeBook Section
Sitemtc-m21c.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP3W34R/3STAKJB
Repositorysid.inpe.br/mtc-m21c/2019/03.13.14.03   (restricted access)
Last Update2019:03.13.14.03.24 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m21c/2019/03.13.14.03.24
Metadata Last Update2022:08.22.23.20.43 (UTC) administrator
Secondary KeyINPE--/
DOI10.1007/978-0-387-34897-1_58
ISBN978-1-4757-6671-4 
978-0-387-34897-1 (eBook)
Citation KeyLorenaLope:1996:DyLiHe
TitleA dynamic list heuristic for 2D-cutting
Year1996
Access Date2024, May 06
Secondary TypePRE LI
Number of Files1
Size456 KiB
2. Context
Author1 Lorena, Luiz Antonio Nogueira
2 Lopes, Fábio Belo
Group1 LAC-INPE-MCT-BR
2 LAC-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais (INPE)
2 Instituto Nacional de Pesquisas Espaciais (INPE)
EditorDolezal, Jaroslav
Fidler, Jiri
Book TitleSystem modelling and optimization: Proceedings of the Seventeenth IFIP TC7 Conference on System Modelling and Optimization, 1995
PublisherSpringer
Pages481-488
History (UTC)2019-03-13 14:03:54 :: simone -> administrator :: 1996
2022-03-08 15:27:24 :: administrator -> simone :: 1996
2022-03-09 18:13:09 :: simone -> administrator :: 1996
2022-08-22 23:20:43 :: administrator -> simone :: 1996
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
KeywordsCutting Stock
Heuristics
Best-first search
Tabu search
AbstractWe present a new heuristic for the 2D-cutting problem, called Dynamic List Heuristic (DLH). The objective is to eliminate the combinatorial explosion of the all rectangle combination's type heuristics, maintaining their good results of reduced waste. Algorithm DLH uses a dynamic list of constructed patterns, included and deleted at convenient times. DLH is based on the A * approach, a best-first tree of candidate solutions, and the use of an auxiliary tabu list for alternate best patterns to avoid excessive repetition. The computational tests for some problems of the literature and many random generated problems, confirm good results using microcomputers.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A dynamic list...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 13/03/2019 11:03 1.8 KiB 
4. Conditions of access and use
Languageen
Target Filelorena_dynamic.pdf
User Groupsimone
Reader Groupadministrator
simone
Visibilityshown
Read Permissiondeny from all
Update Permissionnot transferred
5. Allied materials
Mirror Repositoryurlib.net/www/2017/11.22.19.04.03
Next Higher Units8JMKD3MGPCW/3ESGTTP
Citing Item Listsid.inpe.br/bibdigital/2013/09.22.23.14 4
DisseminationBNDEPOSITOLEGAL
Host Collectionurlib.net/www/2017/11.22.19.04
6. Notes
Empty Fieldsarchivingpolicy archivist callnumber city copyholder copyright creatorhistory descriptionlevel e-mailaddress edition electronicmailaddress format issn label lineage mark nextedition notes numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project resumeid rightsholder schedulinginformation secondarydate secondarymark serieseditor seriestitle session shorttitle sponsor subject tertiarymark tertiarytype translator url volume
7. Description control
e-Mail (login)simone
update 


Close